Intelligent scheduling of public traffic vehicles based on a hybrid genetic algorithm
نویسندگان
چکیده
منابع مشابه
Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملResearch on Public Traffic Vehicles Dispatch Based on Improved Adaptive Genetic Algorithm
Bus dispatching has been studied, and also the bus dispatching model is set up. Then, Genetic Algorithm is adaptively improved in order to avoid premature problem and the slow convergence, and then the keeping optimal strategy is used to the Genetic Algorithm, so formed the Improved Adaptive Genetic Algorithm,namely IAGA. Finally, the IAGA is used to optimizing the bus dispatching model, and th...
متن کاملIntelligent and Robust Genetic Algorithm Based Classifier
The concepts of robust classification and intelligently controlling the search process of genetic algorithm (GA) are introduced and integrated with a conventional genetic classifier for development of a new version of it, which is called Intelligent and Robust GA-classifier (IRGA-classifier). It can efficiently approximate the decision hyperplanes in the feature space. It is shown experime...
متن کاملIntelligent Dispatching of Public Traffic Vehicles in ITS
In many applications, vehicular scheduling involves more complex criteria than that of travel time minimization. With regard to the actual status and operational environment of Public Traffic Vehicles (PTV), the optimal dispatching methods of PTV are dealt with by intelligent characteristics of Genetic Algorithm (GA). With one-point or two-point crossover of GA, various dispatching methods in t...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2008
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(08)70103-2